Determining Bounds on Assumption Errors in Operational Analysis
نویسندگان
چکیده
منابع مشابه
Determining Bounds on Assumption Errors in Operational Analysis
The technique of operational analysis (OA) is used in the study of systems performance, mainly for estimating mean values of various measures of interest, such as, number of jobs at a device and response times. The basic principles of operational analysis allow errors in assumptions to be quantified over a time period. The assumptions which are used to derive the operational analysis relationsh...
متن کاملErrors in Operational Spreadsheets
Spreadsheets are used in almost all businesses, for applications ranging from the mundane to the missioncritical. Errors in the data, formulas, or manipulation of spreadsheets could be costly, even devastating. The received wisdom is that about 5% of all formulas in spreadsheets contain errors, and this rate is consistent across spreadsheets. However, this estimate is based on five studies, som...
متن کاملDetermining Bounds on Execution Times
Interpretation [CC77] is used to compute invariants about cache contents. How the behavior of programs on processor pipelines is predicted follows in Section 0.3. 0.2.1 Cache Memories A cache can be characterized by three major parameters: • capacity is the number of bytes it may contain. • line size (also called block size) is the number of contiguous bytes that are transferred from memory on ...
متن کاملRobustness of the Learning with Errors Assumption
Starting with the work of Ishai-Sahai-Wagner and Micali-Reyzin, a new goal has been set within the theory of cryptography community, to design cryptographic primitives that are secure against large classes of side-channel attacks. Recently, many works have focused on designing various cryptographic primitives that are robust (retain security) even when the secret key is “leaky”, under various i...
متن کاملAlgorithmic Complexity Bounds on Future Prediction Errors
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true distribution μ by the algorithmic complexity of μ. Here we assume that we are at a time t>1 and have already observed x=x1...xt. We bound the future prediction performance on xt+1xt+2... by a new variant of algorithmic c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization
سال: 2014
ISSN: 2356-752X,2314-6486
DOI: 10.1155/2014/460570